Time inhomogeneity in longest gap and longest run problems
نویسندگان
چکیده
منابع مشابه
Longest Segment Problems
The following problem is considered: Given a predicate p on strings. Determine the longest segment of a given string that satisfies p. This paper is an investigation of algorithms solving this problem for various predicates. The predicates considered are expressed in simple functions like the size, the minimum, the maximum, the leftmost and the rightmost element of the segment. The algorithms a...
متن کاملUseful Inequalities for the Longest Run Distribution
General inequalities for the distribution of the longest success run in Bernoulli trials are found through a direct combinatorial analysis. Their employment allows the derivation of a new lower bound which can be used in the achievement of theoretical results.
متن کاملLimit theorems for the longest run
Limit theorems for the longest run in a coin tossing experiment are obtained.
متن کاملLongest run of equal parts in a random integer composition
has L = 5. A composition with L = 1 is known as a Carlitz composition. The characteristics of Carlitz compositions and their generating function C〈1〉(z) (see Proposition 1) are studied in great detail in [4, 5]. The solution to the longest run problem can be broken down into four main sections. In the first section, we find a family of generating functions for integer compositions that keeps tr...
متن کاملThe distribution of longest run lengths in integer compositions
We find the generating function for C(n, k, r), the number of compositions of n into k positive parts all of whose runs (contiguous blocks of constant parts) have lengths less than r, using recent generalizations of the method of Guibas and Odlyzko for finding the number of words that avoid a given list of subwords.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2017
ISSN: 0304-4149
DOI: 10.1016/j.spa.2016.06.018